An algorithm for the multiinput pole assignment problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملThe Robust Pole Assignment Problem for Second-Order Systems
Pole assignment problems are special algebraic inverse eigenvalue problems. In this paper, we research numerical methods of the robust pole assignment problem for second-order systems. The problem is formulated as an optimization problem. Depending upon whether the prescribed eigenvalues are real or complex, we separate the discussion into two cases and propose two algorithms for solving this p...
متن کاملAn efficient cost scaling algorithm for the assignment problem
The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper we apply the method to the assignment problem and investigate implementations of the method that take advantage of assignment's special structure. The results show that the method is very promising for practical use.
متن کاملAn Improved Algorithm for the Generalized Quadratic Assignment Problem
This paper is concerned with solving GQAPs (generalized quadratic assignment problems) to optimality. In these problems, given M facilities and N locations, the facility space requirements, the location available space, the facility installation costs, the flows between facilities, and the distance costs between locations, one must assign each facility to exactly one location so that each locat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1994
ISSN: 0024-3795
DOI: 10.1016/0024-3795(94)90364-6